Online load balancing on uniform machines with limited migration
نویسندگان
چکیده
Consider that one job after another arrives online and must be placed on machines immediately, without knowing which jobs might arrive later. The goal is to balance the load of – sizes divided by machine speed. Each contributes a migration potential proportional its size, can used relocate some previously jobs. This paper presents results with improved competitiveness compared pure case using only very limited migration.
منابع مشابه
Online Load Balancing on Unrelated Machines with Startup Costs
Motivated by applications in energy-efficient scheduling in data centers, Khuller, Li, and Saha introduced the machine activation problem as a generalization of the classical optimization problems of minimum set cover and minimum makespan scheduling on parallel machines. In this problem, a set of n jobs have to be distributed among a set of m (unrelated) machines, given the processing time of e...
متن کاملOnline Load Balancing for Related Machines
In the load balancing (or job scheduling) problem, introduced by Graham in the 1960s (SIAM J. of Appl. Math. 1966, 1969), jobs arriving online have to be assigned to machines so to minimize an objective defined on machine loads. A long line of work has addressed this problem for both the makespan norm and arbitrary lq-norms of machine loads. Recent literature (e.g., Azar et al., STOC 2013; Im e...
متن کاملOn-line Load Balancing for Related Machines
We consider the problem of schedulingpermanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of for the deterministic version, and for its randomized variant, improving the previous competitive ratios of 8 and ! " # . We also prove lower bounds of $ on the competitive ratio of deterministic algorithms and % on the competitive ratio...
متن کاملA Performance Study on Load Balancing Algorithms with Task Migration
In this paper, we present a performance study on three diierent load balancing algorithms. The rst algorithm employs only task assignment, whereas the other two allow both task assignment and migration. We conclude that although task migration usually costs more than task assignment, under some situations it can augment task assignment to provide extra performance improvement. This is because t...
متن کاملOn-Line Load Balancing of Temporary Tasks on Identical Machines
We prove an exact lower bound of 2 1 m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 1 m for randomized algorithms for small m and 2 2 m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2 O( log logm logm )...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2023
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2023.02.013